Finiteness conditions for matrix semigroups
نویسندگان
چکیده
منابع مشابه
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler’s method for analysing lists. Limitations of the method are indicated.
متن کاملThe finiteness problem for automaton semigroups is undecidable
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton semigroups. Given a NW-deterministic Wang tile set, we construct a Mealy automaton, such that the plane admits a valid Wang tiling if and only if the Mealy autom...
متن کاملFiniteness Conditions for Light-Front Hamiltonians
Many advantages of the light-front (LF) formulation for bound state problems arise from the manifest boost invariance in the longitudinal direction [1{5]. The price for this advantage is that other symmetries, such as parity or rotational invariance (for rotations around a transverse axis) are no longer manifest [6,7]. From the technical point of view, the loss of manifest parity and full rotat...
متن کاملFunction spaces of Rees matrix semigroups
We characterize function spaces of Rees matrixsemigroups. Then we study these spaces by using the topologicaltensor product technique.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1973
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1973-0310094-3